Non-Traditional Flow Shop Scheduling Using CSP
نویسندگان
چکیده
منابع مشابه
Flow Shop Scheduling Using Clustered Differential Evolution
A generic approach of population dynamics and clustering for permutative problems is presented in this paper. Diversity indicators are created from solution ordering and its mapping is shown as an advantage for population control in metaheuristics. Differential Evolution Algorithm is embedded with a population based on this approach and vetted with the Flow shop scheduling problem. Extensive ex...
متن کاملBatch Scheduling in Flexible Flow Shop
In this paper, the problem of batch scheduling in a flexible flow shop environment is studied. It is assumed that machines in some stages are able to process a number of jobs simultaneously. The applications of this problem can be found in various industries including spring and wire manufacturing and in auto industry. A mixed integer programming formulation of the problem is presented and it i...
متن کاملBatch Scheduling in Flexible Flow Shop
In this paper, the problem of batch scheduling in a flexible flow shop environment is studied. It is assumed that machines in some stages are able to process a number of jobs simultaneously. The applications of this problem can be found in various industries including spring and wire manufacturing and in auto industry. A mixed integer programming formulation of the problem is presented and it i...
متن کاملMILP Formulation and Genetic Algorithm for Non-permutation Flow Shop Scheduling Problem with Availability Constraints
In this paper, we consider a flow shop scheduling problem with availability constraints (FSSPAC) for the objective of minimizing the makespan. In such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. We proposed a mixed-integer linear programming (MILP) model for this problem which can generate non-permutation schedules. Furthermor...
متن کاملApplication of CSP Algorithms to Job Shop Scheduling Problems
This paper reports an ongoing project of applying CSP algorithms CDGT and CDBT to solving job shop scheduling problems with non-relaxable time windows. A simpliied job shop scheduling task is presented to illustrate the procedure where the given task is converted into a CSP and the synthesis algorithm CDGT is combined with the search algorithm CDBT to nd a feasible or the optimal schedule. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TECCIENCIA
سال: 2016
ISSN: 1909-3667,2422-3670
DOI: 10.18180/tecciencia.2016.20.10